[0, 10, 24, 24, 24, 9, 0, 0, 2, 21]
[0, 10, 0, 16, 16, 16, 1, 1, 2, 17]
[0, 23, 23, 23, 23, 23, 1, 1, 14, 17]
[0, 0, 15, 15, 15, 15, 19, 19, 19, 17]
[22, 22, 0, 0, 25, 25, 19, 19, 19, 17]
[18, 18, 18, 18, 25, 25, 0, 29, 29, 4]
[18, 18, 18, 18, 0, 0, 0, 13, 26, 3]
[0, 0, 5, 5, 5, 5, 20, 13, 8, 8]
[7, 7, 7, 7, 7, 30, 20, 27, 27, 0]
[11, 12, 6, 6, 6, 6, 20, 28, 0, 0]

[[], [[1, 6], [2, 2], 26], [[0, 8], [2, 1], 74], [[6, 9], [1, 1], 3], [[5, 9], [1, 1], 50], [[7, 2], [1, 4], 68], [[9, 2], [1, 4], 87], [[8, 0], [1, 5], 62], [[7, 8], [1, 2], 25], [[0, 5], [1, 1], 57], [[0, 1], [2, 1], 96], [[9, 0], [1, 1], 26], [[9, 1], [1, 1], 43], [[6, 7], [2, 1], 37], [[2, 8], [1, 1], 66], [[3, 2], [1, 4], 88], [[1, 3], [1, 3], 77], [[1, 9], [4, 1], 10], [[5, 0], [2, 4], 38], [[3, 6], [2, 3], 32], [[7, 6], [3, 1], 54], [[0, 9], [1, 1], 26], [[4, 0], [1, 2], 60], [[2, 1], [1, 5], 19], [[0, 2], [1, 3], 8], [[4, 4], [2, 2], 77], [[6, 8], [1, 1], 68], [[8, 7], [1, 2], 38], [[9, 7], [1, 1], 99], [[5, 7], [1, 2], 53], [[8, 5], [1, 1], 2]]
33
[0, 10, 24, 24, 24, 9, 0, 0, 2, 21]
[0, 10, 0, 16, 16, 16, 1, 1, 2, 17]
[0, 23, 23, 23, 23, 23, 1, 1, 14, 17]
[0, 0, 15, 15, 15, 15, 19, 19, 19, 17]
[22, 22, 0, 0, 25, 25, 19, 19, 19, 17]
[18, 18, 18, 18, 25, 25, 0, 29, 29, 4]
[18, 18, 18, 18, 0, 0, 0, 13, 26, 3]
[0, 0, 5, 5, 5, 5, 20, 13, 8, 8]
[7, 7, 7, 7, 7, 30, 20, 27, 27, 0]
[11, 12, 6, 6, 6, 6, 20, 28, 0, 0]

[[], [[1, 6], [2, 2], 26], [[0, 8], [2, 1], 74], [[6, 9], [1, 1], 3], [[5, 9], [1, 1], 50], [[7, 2], [1, 4], 68], [[9, 2], [1, 4], 87], [[8, 0], [1, 5], 62], [[7, 8], [1, 2], 25], [[0, 5], [1, 1], 57], [[0, 1], [2, 1], 96], [[9, 0], [1, 1], 26], [[9, 1], [1, 1], 45], [[6, 7], [2, 1], 37], [[2, 8], [1, 1], 66], [[3, 2], [1, 4], 88], [[1, 3], [1, 3], 77], [[1, 9], [4, 1], 10], [[5, 0], [2, 4], 38], [[3, 6], [2, 3], 32], [[7, 6], [3, 1], 54], [[0, 9], [1, 1], 26], [[4, 0], [1, 2], 60], [[2, 1], [1, 5], 19], [[0, 2], [1, 3], 8], [[4, 4], [2, 2], 77], [[6, 8], [1, 1], 69], [[8, 7], [1, 2], 38], [[9, 7], [1, 1], 99], [[5, 7], [1, 2], 53], [[8, 5], [1, 1], 2]]

[0, 10, 24, 24, 24, 9, 0, 0, 2, 21]
[0, 10, 0, 16, 16, 16, 1, 1, 2, 17]
[0, 23, 23, 23, 23, 23, 1, 1, 14, 17]
[0, 0, 15, 15, 15, 15, 19, 19, 19, 17]
[22, 22, 0, 0, 25, 25, 19, 19, 19, 17]
[18, 18, 18, 18, 25, 25, 0, 29, 29, 4]
[18, 18, 18, 18, 0, 0, 0, 13, 26, 3]
[0, 0, 5, 5, 5, 5, 20, 13, 8, 8]
[7, 7, 7, 7, 7, 30, 20, 27, 27, 0]
[11, 12, 6, 6, 6, 6, 20, 28, 0, 0]

import copy
import sys
input = sys.stdin.readline

L, N, Q = map(int, input().split())

# 맵 정보: 0=빈칸, 1=함정, 2=벽
graph = [list(map(int, input().split())) for _ in range(L)]

# 기사 정보: 인덱스 1~N
# 각 기사: [[r, c], [h, w], k] = 좌상단 좌표, 크기, 체력
knights = [[] for _ in range(N+1)]
for knight_idx in range(1, N+1):
    r, c, h, w, k = map(int, input().split())
    knights[knight_idx] = [[r-1, c-1], [h, w], k]

# 기사 맵 (현재 위치)
knight_graph = [[0] * L for _ in range(L)]
for knight_idx in range(1, N+1):
    r, c = knights[knight_idx][0]
    h, w = knights[knight_idx][1]
    for i in range(h):
        for j in range(w):
            knight_graph[r+i][c+j] = knight_idx

# 이동 방향 (상우하좌)
dx = [-1, 0, 1, 0]
dy = [0, 1, 0, -1]

def move(knight_graph, knights, knight_idx, direction, moved):
    if knights[knight_idx] is None:
        return knight_graph, knights, moved, False

    r, c = knights[knight_idx][0]
    h, w = knights[knight_idx][1]
    health = knights[knight_idx][2]
    nr, nc = r + dx[direction], c + dy[direction]

    # 이동 범위 체크
    for i in range(h):
        for j in range(w):
            x = nr + i
            y = nc + j
            if not (0 <= x < L and 0 <= y < L):
                return knight_graph, knights, moved, False
            if graph[x][y] == 2:
                return knight_graph, knights, moved, False

    # 이동 가능하다면, 충돌 검사
    collided = []
    for i in range(h):
        for j in range(w):
            x = nr + i
            y = nc + j
            other = knight_graph[x][y]
            if other != 0 and other != knight_idx:
                collided.append(other)

    # 먼저 충돌난 기사들을 밀어야 함
    for other in set(collided):
        knight_graph, knights, moved, can_move = move(knight_graph, knights, other, direction, moved)
        if not can_move:
            return knight_graph, knights, moved, False

    # 이전 자리 지우기
    for i in range(h):
        for j in range(w):
            knight_graph[r+i][c+j] = 0

    # 새 좌표 갱신
    knights[knight_idx][0] = [nr, nc]
    moved[knight_idx] = True

    for i in range(h):
        for j in range(w):
            knight_graph[nr+i][nc+j] = knight_idx

    return knight_graph, knights, moved, True

def update_health(knights, moved):
    for knight_idx in range(1, N+1):
        if knights[knight_idx] is None:
            continue

        r, c = knights[knight_idx][0]
        h, w = knights[knight_idx][1]
        health = knights[knight_idx][2]

        # 명령받은 기사는 피해 안 받음
        if not moved[knight_idx]:
            continue

        damage = 0
        for i in range(h):
            for j in range(w):
                if graph[r+i][c+j] == 1:
                    damage += 1

        health -= damage

	if damage > 0:
            print(f"기사 {knight_idx}가 {damage}의 피해를 입음 (남은 체력: {health})")

        if health <= 0:
            # 죽으면 지도에서 제거
            for i in range(h):
                for j in range(w):
                    knight_graph[r+i][c+j] = 0
            knights[knight_idx] = None
        else:
            knights[knight_idx][2] = health

def check_answer(original_knights, knights):
    result = 0
    for idx in range(1, N+1):
        if knights[idx] is None:
            continue
        result += original_knights[idx][2] - knights[idx][2]
    return result

# 명령 수행
original_knights = copy.deepcopy(knights)

for _ in range(Q):
    knight_idx, direction = map(int, input().split())

    if knights[knight_idx] is None:
        continue

    tmp_knight_graph = copy.deepcopy(knight_graph)
    tmp_knights = copy.deepcopy(knights)
    moved = [False] * (N+1)

    tmp_knight_graph, tmp_knights, moved, can_move = move(tmp_knight_graph, tmp_knights, knight_idx, direction, moved)

    if can_move:
        # 명령 받은 기사는 피해 안 입음
        moved[knight_idx] = False
        knight_graph = tmp_knight_graph
        knights = tmp_knights
        update_health(knights, moved)

# 결과 출력
print(check_answer(original_knights, knights))
